Lecture Notes: Social Networks: Models, Algorithms, and Applications
نویسنده
چکیده
For a positive integer n and an even integer k, let C(n, k) denote the graph with vertex set Figure 1: C(8, 4), newly rewired edges are excluded from future rewire. The Watts-Strogatz graph[2], denoted W S(n, k, p) is obtained from C(n, k) by replacing each edge in C(n, k) with probability p by a randomly chosen edge.
منابع مشابه
Analyzing Tools and Algorithms for Privacy Protection and Data Security in Social Networks
The purpose of this research, is to study factors influencing privacy concerns about data security and protection on social network sites and its’ influence on self-disclosure. 100 articles about privacy protection, data security, information disclosure and Information leakage on social networks were studied. Models and algorithms types and their repetition in articles have been distinguished a...
متن کاملRare Events and Heavy Tails in Stochastic Systems
This is a set of lecture notes on large deviations and heavy tails in stochastic systems. After an introduction, a short and biased review on heavy-tailed distribution is given. Applications are mostly concerned with stochastic networks, and cover single-server queues, regenerative processes, and fluid models.
متن کاملLecture Notes for Introduction to Decision Theory
12 Arrow's Impossibility Theorem 72 13 References 75 2 These are notes for a basic class in decision theory. The focus is on decision under risk and under uncertainty, with relatively little on social choice. The notes contain the mathematical material, including all the formal models and proofs that will be presented in class, but they do not contain the discussion of background, interpretatio...
متن کاملFactors affecting students tendency of Univercity students to Lecture Notes
Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...
متن کاملCS 167 : Reading in Algorithms Triangle - Dense Graphs ∗
In these notes we discuss a paper of Gupta, Roughgarden, and Seshadhri, “Decompositions of Triangle-Dense Graphs” [1]. The motivation of the paper is to develop a theory of algorithms for social networks, like the graphs derived from Facebook or Twitter data mentioned in the first lecture. That is, the goal is to develop graph algorithms that work well on social networks, if not on worst-case g...
متن کامل